Hey, remember that CPS converter I wrote a while back? Well, it sucked.

Granted, I have an erection for the CPS transform itself. By making continuations explicit we not only tail-call optimization easy, we also enable the fast implementation of call-with-current-continuation and other control constructs like delimited continuations ( Read more... )

Last night I wrote a little lambda-calculus evaluator in Haskell. It only does beta-reduction, and is inadequate because it does not properly alpha-substitute terms which are bound in a lambda-expression but free in what that lambda-expression may be applied to. Hence, you won't see it here now.

Needless to say, I am enjoying getting into Haskell